Heuristic Approach for Specially Structured Two Stage Flow Shop Scheduling to Minimize the Rental Cost, Processing Time, Set Up Time Are Associated with Their Probabilities Including Transportation Time and Job Weightage

Optimal Two Stages Specially Structured Flow Shop Scheduling: Minimize the Rental Cost with Independent Setup Time

One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...

Two Stage Flow Shop Scheduling Problem Including Transportation Time and Weightage of Jobs with Branch and Bound Method

On Two Stage Open Shop Scheduling in Which Processing Time, Set Up Time Associated with Probabilities Including Job Block Criteria

INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY On Two Stage Open Shop Scheduling in Which Processing Time, Set Up Time Associated with Probabilities Including Job Block Criteria Deepak Gupta, Manjeet Kaur *1,2 Department of Mathematics, Maharishi Markandeshwar University, Mullana, Ambala, India [email protected] Abstract The present paper is an attempt through heu...

Minimization of Utilization Time for Two Stage Specially Structured Flow Shop Scheduling problem with Setup Time, Job Weightage and Jobs in a String of Disjoint Job Blocks

In this paper we study specially structured two stage flow shop scheduling problem with jobs in a string of disjoint job blocks having sequence independent setup times separated from processing times each associated with their respective probabilities including job weightage. In flow shop scheduling optimization of elapsed time may not always result in optimization of utilization time. Here, th...

On Specially Structured Two Stage Flow Shop Scheduling Problem with Setup Time Separated from Processing Time and Jobs in a String of Disjoint Job Blocks

This paper relates to two stage specially structured flow shop scheduling problem with jobs in a string of disjoint job blocks having sequence independent setup times separated from processing times each associated with their respective probabilities, where the optimization criteria is the utilization time of machines. To minimize the utilization time an algorithm is proposed and a numerical ex...

Investigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices

In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...